Interconvertibility of Set Constraints and Context-free Language Reachability 1
نویسندگان
چکیده
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gives a solution to the set-constraint problem. The interconvertibil-ity of these two formalisms ooers an conceptual advantage akin to the advantage gained from the interconvertibility of nite-state automata and regular expressions in formal language theory, namely, a problem can be formulated in whichever formalism is most natural. It also ooers some insight into the \O(n 3) bottleneck" for diierent types of program-analysis problems, and allows results previously obtained for context-free-language reachability problems to be applied to set-constraint problems.
منابع مشابه
Interconvertibility of a Class of Set Constraints and Context-free-language Reachability 1
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gi...
متن کاملInterconvertibility of a class of set constraints and context-free-language reachability
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gi...
متن کاملInterconvertibility of Set Constraints and Context-free Language Reachability
We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gi...
متن کاملFrom Polymorphic Subtyping to CFL Reachability: Context-Sensitive Flow Analysis Using Instantiation Constraints
متن کامل
An E � cient Algorithm for Solving the Dyck - CFL Reachability Problem on Trees ?
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as points-to-analysis. Solving the CFL reachability problem in the general case is very hard. Popular solutions resorting to a graph traversal exhibit a time complexity of O(kn) for a grammar of size k. For Dyck CFLs, a parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996